Sharp bounds on sufficient-cause interactions under the assumption of no redundancy
نویسنده
چکیده
BACKGROUND Sufficient-cause interaction is a type of interaction that has received much attention recently. The sufficient component cause model on which the sufficient-cause interaction is based is however a non-identifiable model. Estimating the interaction parameters from the model is mathematically impossible. METHODS In this paper, I derive bounding formulae for sufficient-cause interactions under the assumption of no redundancy. RESULTS Two real data sets are used to demonstrate the method (R codes provided). The proposed bounds are sharp and sharper than previous bounds. CONCLUSIONS Sufficient-cause interactions can be quantified by setting bounds on them.
منابع مشابه
Testing for Sufficient-Cause Gene-Environment Interactions Under the Assumptions of Independence and Hardy-Weinberg Equilibrium.
To detect gene-environment interactions, a logistic regression model is typically fitted to a set of case-control data, and the focus is on testing of the cross-product terms (gene × environment) in the model. A significant result is indicative of a gene-environment interaction under a multiplicative model for disease odds. Based on the sufficient-cause model for rates, in this paper we put for...
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملA Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کاملPartial Identi cation and Con dence Sets for Functionals of the Joint Distribution of Potential Outcomes
In this paper, we study partial identi cation and inference for a general class of functionals of the joint distribution of potential outcomes of a binary treatment under the strong ignorability assumption or the selection on observables assumption commonly used in evaluating average treatment e ects. Members of this class of functionals include the correlation coe cient between the potential o...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کامل